Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers
نویسندگان
چکیده
This article presents a new class of Pseudorandom Number Generators. The generators are based on traversing a n-cube where a Balanced Hamiltonian Cycle has been removed. The construction of such generators is automatic for small number of bits, but remains an open problem when this number becomes large. A running example is used throughout the paper. Finally, first statistical experiments of these generators are presented, they show how efficient and promising the proposed approach seems.
منابع مشابه
Random Walk in a N-cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations
Designing a pseudorandom number generator (PRNG) is a difficult and complex task. Many recent works have considered chaotic functions as the basis of built PRNGs: the quality of the output would indeed be an obvious consequence of some chaos properties. However, there is no direct reasoning that goes from chaotic functions to uniform distribution of the output. Moreover, embedding such kind of ...
متن کاملConstruction of Hamiltonian Cycles with a Given Spectrum of Edge Directions in an n-Dimensional Boolean Cube
The spectrum of a Hamiltonian cycle (of a Gray code) in an n-dimensional Boolean cube is the series a = (a1, . . . , an), where ai is the number of edges of the ith direction in the cycle. The necessary conditions for the existence of a Gray code with the spectrum a are available: the numbers ai are even and, for k = 1, . . . , n, the sum of k arbitrary components of a is at least 2. We prove t...
متن کاملHamiltonian Cycle within Extended OTIS-Cube Topology
This paper introduces a complete description of constructing a Hamiltonian cycle in the Extended OTIS-n-Cube topology. The recently proposed network has many good topological features such as regular degree, semantic structure, low diameter, and ability to embed graphs and cycles. Constructing a Hamiltonian cycle is an important feature for any topology due to the importance of broadcast messag...
متن کاملA systematic approach for finding Hamiltonian cycles with a prescribed edge in crossed cubes
The crossed cube is one of the most notable variations of hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is almost the half of that of the hypercube. In this paper, we focus on the problem embedding a Hamiltonian cycle through an arbitrary given edge in the crossed cube. We give necessary and sufficient condition f...
متن کاملThe Balanced Hamiltonian Cycle on the Toroidal Mesh Graphs
The balanced Hamiltonian cycle problem is a quiet new topic of graph theorem. Given a graph G = (V, E), whose edge set can be partitioned into k dimensions, for positive integer k and a Hamiltonian cycle C on G. The set of all i-dimensional edge of C, which is a subset by E(C), is denoted as Ei(C). If ||Ei(C)| |Ej(C)|| 1 for 1 i < j k, C is called a balanced Hamiltonian cycle. In this paper, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.08923 شماره
صفحات -
تاریخ انتشار 2014